Efficient Circuitry for Computing τ-adic Non-Adjacent Form
نویسندگان
چکیده
Elliptic curve point multiplication kP on an elliptic curve is required in every elliptic curve cryptosystem. The operation can be significantly accelerated by using a special type of elliptic curves called the Koblitz curves and by representing the integer k in τ -adic nonadjacent form (τNAF). Hardware-friendly modifications of existing τNAF conversion algorithms are presented and an efficient circuitry for the τNAF conversion is described with performance characteristics on an Altera Stratix-II S60C4 FPGA. To the authors’ knowledge, this is the first published hardware implementation of the τNAF conversion.
منابع مشابه
Koblitz Curves and Integer Equivalents of Frobenius Expansions
Scalar multiplication on Koblitz curves can be very efficient due to the elimination of point doublings. Modular reduction of scalars is commonly performed to reduce the length of expansions, and τ -adic NonAdjacent Form (NAF) can be used to reduce the density. However, such modular reduction can be costly. An alternative to this approach is to use a random τ -adic NAF, but some cryptosystems (...
متن کاملEfficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics
In elliptic curve cryptosystems, scalar multiplications performed on the curves have much effect on the efficiency of the schemes, and many efficient methods have been proposed. In particular, recoding methods of the scalars play an important role in the performance of the algorithm used. For integer radices, non-adjacent form (NAF) and its generalizations (e.g., generalized non-adjacent form (...
متن کاملRedundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication
This paper investigates some properties of τ -adic expansions of scalars. Such expansions are widely used in the design of scalar multiplication algorithms on Koblitz Curves, but at the same time they are much less understood than their binary counterparts. Solinas introduced the width-w τ -adic non-adjacent form for use with Koblitz curves. This is an expansion of integers z = Pl i=0 ziτ , whe...
متن کاملFPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = ∑ ±τ(τ − 1) and k = ∑ ±τ(τ −1)(τ− τ −1). We prove that the number of terms in the second type is sublinear in the bit length of k, which leads to the first provably sublinear point multiplication algorithm on Koblitz curves. For the first type, we conjecture that the number of terms ...
متن کاملSome properties of $τ$-adic expansions on hyperelliptic Koblitz curves
This paper explores two techniques on a family of hyperelliptic curves that have been proposed to accelerate computation of scalar multiplication for hyperelliptic curve cryptosystems. In elliptic curve cryptosystems, it is known that Koblitz curves admit fast scalar multiplication, namely, the τ -adic non-adjacent form (τ -NAF). It is shown that the τ -NAF has the three properties: (1) existen...
متن کامل